منابع مشابه
A Simple Algorithm for Stable Minimum Storage Merging
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algorithm performs O(m log( n m + 1)) comparisons and O((m + n) log m) assignments, where m and n are the sizes of the input sequences with m ≤ n. Hence, according to the lower bounds of merging the algorithm is asymptotica...
متن کاملA Simple Algorithm for Learning Stable Machines
We present an algorithm for learning stable machines which is motivated by recent results in statistical learning theory. The algorithm is similar to Breiman’s bagging despite some important differences in that it computes an ensemble combination of machines trained on small random sub-samples of an initial training set. A remarkable property is that it is often possible to just use the empiric...
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملa new algorithm and software of individual life insurance and annuity computation
چکیده ندارد.
15 صفحه اولOptimal Stable Merging
This paper shows how to stably merge two sequences A and B of sizes m and n, m n, respectively, with O m n assignments, O m log n=m 1 comparisons and using only a constant amount of additional space. This result matches all known lower bounds and closes an open problem posed by Dudzinski and Dydek in 1981. Our algorithm is based on the unstable algorithm of Mannila and Ukkonen. All techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2010
ISSN: 1976-9172
DOI: 10.5391/jkiis.2010.20.4.455